Efficient computation of the inner product matrix of discrete autocorrelation wavelets
نویسندگان
چکیده
Discrete autocorrelation wavelets have recently been applied in the statistical analysis of locally stationary time series. This form of time series analysis also requires the construction of the inner product matrix of such wavelets. To date, both discrete autocorrelation wavelets and the inner product matrix have been constructed via a brute force technique which proves to be computationally expensive. We propose a recursive approach for the construction of discrete autocorrelation wavelets. This is an O(2J) operation, which compares favourably with the O(22J ) operations required by the brute-force approach. An alternative method of constructing the inner product matrix is also proposed. This recursive construction relates neighbouring elements of the inner product matrix, utilising the recursive structure which connects discrete autocorrelation wavelets at varying scales. We conclude by suggesting a construction for the inner product matrix of (separable) two-dimensional autocorrelation wavelets, together with an outline of how this matrix may be constructed efficiently.
منابع مشابه
The inner product matrix of discrete autocorrelation wavelets: efficient computation and application
Discrete autocorrelation (a.c.) wavelets have recently been applied in the statistical analysis of locally stationary time series for local spectral modelling and estimation. This article proposes a fast recursive construction of the inner product matrix of discrete a.c. wavelets which is required by the statistical analysis. The recursion connects neighbouring elements on diagonals of the inne...
متن کاملEfficient computation of the discrete autocorrelation wavelet inner product matrix
Discrete autocorrelation (a.c.) wavelets have recently been applied in the statistical analysis of locally stationary time series for local spectral modelling and estimation. This article proposes a fast recursive construction of the inner product matrix of discrete a.c. wavelets which is required by the statistical analysis. The recursion connects neighbouring elements on diagonals of the inne...
متن کاملWavelet Methods for Time Series and Spatial Data
This thesis considers the application of wavelet methods to the analysis of time series and spatial data. In the rst part, we propose a locally stationary model of the covariance structure for data which lie on a regular grid. This is achieved by moving from a (global) Fourier decomposition of structure to a localised decomposition involving a set of discrete, non-decimated wavelets. The propos...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملWavelet Radiative Transport and Surface Interaction
Recently, there has been considerable interest in the representation of radiance in terms of wavelet basis functions. We will present a coordinate system called Nusselt coordinates which, when combined with wavelets, considerably simpliies computation of radiative transport and surface interaction. It also provides straightforward computation of the physical quantities involved. We show how to ...
متن کامل